A Wiener–Hopf approximation technique for a multiple plate diffraction problem
نویسندگان
چکیده
منابع مشابه
A Two Level Approximation Technique for Structural Optimization
This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...
متن کاملA new Stochastic Hybrid Technique for DER Problem
This paper presents a new Hybrid Particle Swarm optimization with Time Varying Acceleration Coefficients (HPSOTVAC) and Bacteria Foraging Algorithm (BFA) namely (PSOTVAC/BFA) base fuzzy stochastic long term approach for determining optimum location and size of Distributed Energy Resources (DERs). The Monte Carlo simulation method is used to model the uncertainties associated with long-term load...
متن کاملA new Stochastic Hybrid Technique for DER Problem
This paper presents a new Hybrid Particle Swarm optimization with Time Varying Acceleration Coefficients (HPSOTVAC) and Bacteria Foraging Algorithm (BFA) namely (PSOTVAC/BFA) base fuzzy stochastic long term approach for determining optimum location and size of Distributed Energy Resources (DERs). The Monte Carlo simulation method is used to model the uncertainties associated with long-term load...
متن کاملA successive approximation algorithm for the multiple knapsack problem
It is well-known that the multiple knapsack problem is NP-hard, and does not admit an FPTAS even for the case of two identical knapsacks. Whereas the 0-1 knapsack problem with only one knapsack has been intensively studied, and some effective exact or approximation algorithms exist. A natural approach for the multiple knapsack problem is to pack the knapsacks successively by using an effective ...
متن کاملA Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as follows. We are given a set of n items and m bins (knapsacks) such that each item i has a profit p(i) and a size s(i), and each bin j has a capacity c(j). The goal is to find a subset of items of maximum profit such that they have a feasible packing in the bins. MKP is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods in the Applied Sciences
سال: 2003
ISSN: 0170-4214,1099-1476
DOI: 10.1002/mma.432